منابع مشابه
A Type-Directed Negation Elimination
In the modal μ-calculus, a formula is well-formed if each recursive variable occurs underneath an even number of negations. By means of De Morgan’s laws, it is easy to transform any well-formed formula φ into an equivalent formula without negations – the negation normal form of φ . Moreover, if φ is of size n, the negation normal form of φ is of the same size O(n). The full modal μ-calculus and...
متن کاملCoordination Games on Directed Graphs
We study natural strategic games on directed graphs, which capture the idea of coordination in the absence of globally common strategies. We show that these games do not need to have a pure Nash equilibrium and that the problem of determining their existence is NP-complete. The same holds for strong equilibria. We also exhibit some classes of games for which strong equilibria exist and prove th...
متن کاملDirected and weighted majority games
In this paper we deal with several classes of simple games; the first class is the one of ordered simple games (i.e. they admit of a complete desirability relation). The second class consists of all zero-sum games in the first one. First of all we introduce a "natural" partial order on both classes respectively and prove that this order relation admits a rank function. Also the first class turn...
متن کاملAsymmetric directed graph coloring games
This note generalizes the (a, b)-coloring game and the (a, b)-marking game which were introduced by Kierstead [7] for undirected graphs to directed graphs. We prove that the (a, b)-chromatic and (a, b)-coloring number for the class of orientations of forests is b + 2 if b ≤ a, and infinity otherwise. From these results we deduce upper bounds for the (a, b)-coloring number of oriented outerplana...
متن کاملStrategy Elimination in Games with Interaction Structures
We study games in the presence of an interaction structure, which allows players to communicate their preferences, assuming that each player initially only knows his own preferences. We study the outcomes of iterated elimination of strictly dominated strategies (IESDS) that can be obtained in any given state of communication. We also give epistemic foundations for these “intermediate” IESDS out...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2016
ISSN: 0166-218X
DOI: 10.1016/j.dam.2014.08.030